Symbolic partition in chaotic maps
نویسندگان
چکیده
In this work, we only use data on the unstable manifold to locate partition boundaries by checking folding points at different levels, which practically coincide with homoclinic tangencies. The method is then applied classic two-dimensional Hénon map and a well-known three-dimensional map. Comparison previous results made in case, Lyapunov exponents are computed through metric entropy based show validity of current scheme.
منابع مشابه
A Canonical Partition of the Periodic Orbits of Chaotic Maps
We show that the periodic orbits of an area-contracting horseshoe map can be partitioned into subsets of orbits of minimum period k, 2k, 4k, 8k, ..., for some positive integer k. This partition is natural in the following sense: for any parametrized area-contracting map which forms a horseshoe, the orbits in one subset of the partition are contained in a single component of orbits in the full p...
متن کاملWatermarking Scheme Based on Multiple Chaotic Maps
a watermarking scheme for Grayscale image isproposed based on a family of the chaotic maps and discretecosine transform. Jacobian Elliptic mapis employed to encrypt ofwatermarked logo. Piecewise nonlinear chaotic map is also usedto determine the location of DCT coefficients for the watermarkembedding. The purpose of this algorithm is to improve theshortcoming of watermarking such as small key s...
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
Reduction Based Symbolic Value Partition
The symbolic value partition problem is more general than the reduct problem and more complicated than the discretization problem. In this paper, we point out that the symbolic value partition problem can be converted into a series of reduct problems and propose an algorithm called reduction based symbolic value partition (RBSVP) whose all possible outputs form the set of all partition reducts....
متن کاملwatermarking scheme based on multiple chaotic maps
a watermarking scheme for grayscale image isproposed based on a family of the chaotic maps and discretecosine transform. jacobian elliptic mapis employed to encrypt ofwatermarked logo. piecewise nonlinear chaotic map is also usedto determine the location of dct coefficients for the watermarkembedding. the purpose of this algorithm is to improve theshortcoming of watermarking such as small key s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chaos
سال: 2021
ISSN: ['1527-2443', '1089-7682', '1054-1500']
DOI: https://doi.org/10.1063/5.0042705